On the Estrada index of graphs with given number of cut edges

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ela on the Estrada Index of Graphs with given Number of Cut Edges

Let G be a simple graph with eigenvalues λ1, λ2, . . . , λn. The Estrada index of G is defined as EE(G) = ∑ n i=1 ei . In this paper, the unique graph with maximum Estrada index is determined among connected graphs with given numbers of vertices and cut edges.

متن کامل

On the Estrada index of graphs with given number of cut edges

Let G be a simple graph with eigenvalues λ1, λ2, . . . , λn. The Estrada index of G is defined as EE(G) = ∑ n i=1 ei . In this paper, the unique graph with maximum Estrada index is determined among connected graphs with given numbers of vertices and cut edges.

متن کامل

On the variable sum exdeg index and cut edges of graphs

The variable sum exdeg index of a graph G is defined as $SEI_a(G)=sum_{uin V(G)}d_G(u)a^{d_G(u)}$, where $aneq 1$ is a positive real number,  du(u) is the degree of a vertex u ∈ V (G). In this paper, we characterize the graphs with the extremum variable sum exdeg index among all the graphs having a fixed number of vertices and cut edges, for every a>1.

متن کامل

The Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges

LetB(n, r) be the set of all bicyclic graphs with n vertices and r cut edges. In this paper we determine the unique graph with maximal adjacency spectral radius or signless Laplacian spectral radius among all graphs in B(n, r).

متن کامل

Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges

For a graph, the first Zagreb index M1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices. Denote by Gn,k the set of graphs with n vertices and k cut edges. In this paper, we showed the types of graphs with the largest and the second largest M1 and M2 among Gn,k .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Linear Algebra

سال: 2011

ISSN: 1081-3810

DOI: 10.13001/1081-3810.1459